Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 28, 2024 18:33ndrenndrenScore: 145,302Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:33144,2271,229,242,5381,125,078,00072,005,0002,277,376
2Oct 28, 2024 18:33144,2641,228,407,6941,125,425,00071,963,0002,383,872
3Oct 28, 2024 18:33144,3171,228,762,1811,128,842,00068,990,0002,277,376
4Oct 28, 2024 18:33145,2491,228,704,0551,145,586,00059,978,0002,277,376
5Oct 28, 2024 18:33145,3021,233,602,2271,143,010,00063,000,0002,277,376
6Oct 28, 2024 18:33145,4571,234,251,3961,147,332,00059,965,0002,277,376
7Oct 28, 2024 18:33145,5251,235,168,2791,145,863,00061,992,0002,392,064
8Oct 28, 2024 18:33149,7201,269,932,3581,172,694,00069,981,0002,387,968
9Oct 28, 2024 18:33154,4091,309,305,8981,202,623,00078,975,0002,277,376