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 29, 2026 02:00Charles CabergsCharles CabergsScore: 13,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 02:0013,234125,946,012107,851,0001,997,0002,371,584
2Apr 29, 2026 02:0013,242127,201,005107,912,0001,998,0002,355,200
3Apr 29, 2026 02:0013,271125,037,541108,153,0002,002,0002,293,760
4Apr 29, 2026 02:0013,323123,517,509109,582,0001,005,0002,281,472
5Apr 29, 2026 02:0013,369130,254,152108,964,0001,999,0002,359,296
6Apr 29, 2026 02:0013,516129,483,894109,209,0002,978,0002,437,120
7Apr 29, 2026 02:0013,561132,843,613111,553,0001,004,0002,310,144
8Apr 29, 2026 02:0013,581126,880,416110,733,0001,995,0002,314,240
9Apr 29, 2026 02:0013,595139,002,208110,842,0001,997,0002,310,144