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 listAug 27, 2026 19:03Victor MerckléVictor MerckléScore: 3,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 19:033,69239,642,06029,496,0001,154,0002,113,536
2Aug 27, 2026 19:033,70939,078,27629,710,0001,077,0002,113,536
3Aug 27, 2026 19:033,71138,993,28129,748,0001,059,0002,113,536
4Aug 27, 2026 19:033,71239,138,33629,665,0001,148,0002,113,536
5Aug 27, 2026 19:033,72839,250,67629,861,0001,089,0002,113,536
6Aug 27, 2026 19:033,74340,069,10429,945,0001,124,0002,113,536
7Aug 27, 2026 19:033,74540,139,45929,958,0001,127,0002,113,536
8Aug 27, 2026 19:033,75140,525,83829,985,0001,154,0002,113,536
9Aug 27, 2026 19:033,83740,147,75230,763,0001,091,0002,113,536