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 listJul 14, 2026 21:10boop34boop34Score: 13,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:1013,365120,624,703109,899,0001,037,0002,113,536
2Jul 14, 2026 21:1013,368120,637,371109,905,0001,055,0002,113,536
3Jul 14, 2026 21:1013,383120,822,912110,023,0001,062,0002,113,536
4Jul 14, 2026 21:1013,502122,207,186111,022,0001,050,0002,113,536
5Jul 14, 2026 21:1013,506122,357,208111,046,0001,055,0002,113,536
6Jul 14, 2026 21:1013,553122,192,470111,460,0001,038,0002,113,536
7Jul 14, 2026 21:1013,929125,860,290114,543,0001,075,0002,113,536
8Jul 14, 2026 21:1013,972126,250,882114,901,0001,069,0002,113,536
9Jul 14, 2026 21:1014,043126,690,196115,495,0001,063,0002,113,536