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 listJun 24, 2026 23:47Victor MerckléVictor MerckléScore: 4,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:484,17042,108,61133,494,0001,117,0002,113,536
2Jun 24, 2026 23:484,17842,127,45533,544,0001,135,0002,113,536
3Jun 24, 2026 23:484,17942,319,22033,588,0001,102,0002,113,536
4Jun 24, 2026 23:484,18242,620,60333,600,0001,115,0002,113,536
5Jun 24, 2026 23:484,18342,185,34333,622,0001,100,0002,113,536
6Jun 24, 2026 23:484,20242,572,22033,773,0001,106,0002,113,536
7Jun 24, 2026 23:484,21342,607,89533,870,0001,100,0002,113,536
8Jun 24, 2026 23:484,31943,549,44434,746,0001,109,0002,113,536
9Jun 24, 2026 23:484,32243,593,51734,770,0001,104,0002,113,536