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 26, 2026 14:10Charles CabergsCharles CabergsScore: 13,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:1012,929126,179,510106,315,0001,002,0002,375,680
2Apr 26, 2026 14:1012,941127,203,728106,411,0001,003,0002,367,488
3Apr 26, 2026 14:1013,002124,425,282105,926,0001,998,0002,367,488
4Apr 26, 2026 14:1013,043129,430,544107,262,0001,002,0002,371,584
5Apr 26, 2026 14:1013,476126,540,882109,862,0001,997,0002,371,584
6Apr 26, 2026 14:1013,476128,659,021109,862,0001,997,0002,359,296
7Apr 26, 2026 14:1013,480131,101,892109,894,0001,998,0002,363,392
8Apr 26, 2026 14:1013,485127,732,974109,928,0001,998,0002,375,680
9Apr 26, 2026 14:1013,491129,976,537109,977,0001,999,0002,363,392