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 listMay 14, 2026 08:31Victor MerckléVictor MerckléScore: 62,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:3162,278525,022,776505,449,00011,460,0002,117,632stderr
2May 14, 2026 08:3162,283526,053,735504,946,00012,007,0002,117,632stderr
3May 14, 2026 08:3162,284524,816,732505,695,00011,264,0002,117,632stderr
4May 14, 2026 08:3162,303526,603,181505,454,00011,663,0002,117,632stderr
5May 14, 2026 08:3162,311524,618,339505,657,00011,526,0002,117,632stderr
6May 14, 2026 08:3162,315524,569,520505,480,00011,738,0002,117,632stderr
7May 14, 2026 08:3162,320526,759,654506,026,00011,235,0002,117,632stderr
8May 14, 2026 08:3162,334526,646,165505,099,00012,280,0002,117,632stderr
9May 14, 2026 08:3162,389525,155,071505,970,00011,859,0002,117,632stderr