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 listFeb 18, 2026 18:10Daniel MastalerzDaniel MastalerzScore: 6,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:116,12374,544,88540,856,0009,965,0002,379,776
2Feb 18, 2026 18:106,13275,578,57041,911,0008,981,0002,392,064
3Feb 18, 2026 18:116,17874,741,89940,216,00011,059,0002,269,184
4Feb 18, 2026 18:106,19774,101,02844,378,0007,060,0002,330,624
5Feb 18, 2026 18:116,22383,861,45741,521,00010,127,0002,502,656
6Feb 18, 2026 18:106,23878,166,77943,810,0007,965,0002,400,256
7Feb 18, 2026 18:106,44775,111,07745,430,0008,076,0002,387,968
8Feb 18, 2026 18:116,54078,992,93346,238,0008,041,0002,379,776
9Feb 18, 2026 18:106,54182,790,27746,251,0008,043,0002,293,760
10Feb 18, 2026 18:106,55183,178,08748,333,0006,041,0002,342,912
11Feb 18, 2026 18:116,56677,126,73346,424,0008,073,0002,523,136
12Feb 18, 2026 18:116,58280,310,23349,573,0005,058,0002,367,488