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 listApr 12, 2026 21:57Josu San MartinJosu San MartinScore: 5,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 21:575,00363,860,18540,514,0001,012,0002,424,832
2Apr 12, 2026 21:365,01466,513,29940,602,0001,015,0002,420,736
3Apr 12, 2026 21:365,08463,739,88840,186,0002,009,0002,433,024
4Apr 12, 2026 21:575,22964,677,72142,391,0001,009,0002,285,568
5Apr 12, 2026 21:365,23265,509,52642,415,0001,009,0002,416,640
6Apr 12, 2026 21:575,28072,123,16341,831,0001,991,0002,428,928