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 listMar 4, 2026 15:03juniskewljuniskewlScore: 2,069,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:032,064,53017,172,240,92217,067,634,00067,966,0002,281,472
2Mar 4, 2026 15:032,067,55917,190,657,13417,077,777,00082,964,0002,281,472
3Mar 4, 2026 15:032,067,82717,194,639,76917,100,993,00061,974,0002,281,472
4Mar 4, 2026 15:032,068,30717,204,179,97117,106,970,00059,975,0002,289,664
5Mar 4, 2026 15:032,069,35917,210,624,59317,103,712,00071,969,0002,281,472
6Mar 4, 2026 15:032,069,70217,212,412,58917,094,566,00083,958,0002,281,472
7Mar 4, 2026 15:032,069,92417,210,695,73917,111,398,00068,969,0002,293,760
8Mar 4, 2026 15:032,071,81217,231,207,50817,121,078,00074,965,0002,293,760
9Mar 4, 2026 15:032,266,31418,845,583,95818,722,434,00087,969,0002,523,136