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 listJul 7, 2026 04:04wnwnScore: 3,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:113,26534,921,49526,095,0001,007,0002,113,536
2Jul 7, 2026 04:113,30635,292,13526,406,0001,036,0002,113,536
3Jul 7, 2026 04:113,36936,089,93626,953,0001,017,0002,113,536
4Jul 7, 2026 04:113,40236,106,09527,230,0001,011,0002,113,536
5Jul 7, 2026 04:113,43336,269,61627,494,0001,006,0002,113,536
6Jul 7, 2026 04:113,44937,108,37127,602,0001,026,0002,113,536
7Jul 7, 2026 04:113,44937,092,59627,622,0001,006,0002,113,536
8Jul 7, 2026 04:113,45236,461,57327,638,0001,015,0002,113,536
9Jul 7, 2026 04:113,48837,294,96727,912,0001,046,0002,113,536