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 listSep 17, 2026 00:50Andrew EpsteinAndrew EpsteinScore: 5,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:515,41355,329,44842,679,0002,256,0002,121,728stderr
2Sep 17, 2026 00:515,43155,421,52142,819,0002,265,0002,121,728stderr
3Sep 17, 2026 00:515,44555,758,79842,936,0002,265,0002,121,728stderr
4Sep 17, 2026 00:515,54257,050,89343,702,0002,299,0002,121,728stderr
5Sep 17, 2026 00:515,56656,610,59044,146,0002,054,0002,121,728stderr
6Sep 17, 2026 00:515,56857,321,86043,930,0002,285,0002,121,728stderr
7Sep 17, 2026 00:515,58556,732,06144,075,0002,281,0002,121,728stderr
8Sep 17, 2026 00:515,58857,407,70644,091,0002,293,0002,121,728stderr
9Sep 17, 2026 00:515,61457,750,66644,553,0002,047,0002,121,728stderr