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 listApr 22, 2026 00:40Taylor DettlingTaylor DettlingScore: 33,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:4130,832276,977,113253,909,0001,999,0002,334,720
2Apr 22, 2026 00:4130,850277,685,509254,060,0002,000,0002,351,104
3Apr 22, 2026 00:4130,868271,848,930254,205,0002,001,0002,334,720
4Apr 22, 2026 00:4130,934269,098,860253,760,0002,997,0002,355,200
5Apr 22, 2026 00:4133,608299,046,830276,949,0001,999,0002,355,200
6Apr 22, 2026 00:4133,634301,199,651277,168,0002,001,0002,351,104
7Apr 22, 2026 00:4133,659293,679,486277,371,0002,002,0002,342,912
8Apr 22, 2026 00:4133,702294,797,604276,737,0002,997,0002,351,104
9Apr 22, 2026 00:4133,721294,505,247276,893,0002,998,0002,322,432