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 24, 2026 06:24wnwnScore: 3,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:243,38336,895,33727,072,0001,007,0002,113,536
2Sep 24, 2026 06:243,39436,907,66127,155,0001,018,0002,113,536
3Sep 24, 2026 06:243,40337,010,74327,203,0001,042,0002,113,536
4Sep 24, 2026 06:243,40438,184,57127,213,0001,047,0002,113,536
5Sep 24, 2026 06:243,51437,869,37628,165,0001,009,0002,113,536
6Sep 24, 2026 06:243,53238,817,31828,313,0001,004,0002,113,536
7Sep 24, 2026 06:243,56138,996,02428,548,0001,009,0002,113,536
8Sep 24, 2026 06:243,58239,203,56128,686,0001,045,0002,113,536
9Sep 24, 2026 06:243,58538,522,36928,750,0001,009,0002,113,536