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 listSep 6, 2026 10:41Kevin HeaveyKevin HeaveyScore: 3,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:423,50939,253,44928,092,0001,040,0002,113,536
2Sep 6, 2026 10:423,52637,842,26828,059,0001,209,0002,113,536
3Sep 6, 2026 10:423,53637,681,64428,140,0001,210,0002,113,536
4Sep 6, 2026 10:423,53840,784,83728,336,0001,035,0002,113,536
5Sep 6, 2026 10:423,54637,822,46128,397,0001,038,0002,113,536
6Sep 6, 2026 10:423,56337,881,93328,371,0001,207,0002,113,536
7Sep 6, 2026 10:423,59938,318,57328,800,0001,075,0002,113,536
8Sep 6, 2026 10:423,76642,414,91330,226,0001,040,0002,113,536
9Sep 6, 2026 10:423,80842,799,40430,590,0001,018,0002,113,536