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 31, 2026 18:07boop34boop34Score: 8,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:078,50180,537,82169,338,0001,226,0002,113,536
2Jul 31, 2026 18:078,51780,700,98569,499,0001,195,0002,113,536
3Jul 31, 2026 18:078,52580,755,17969,608,0001,150,0002,113,536
4Jul 31, 2026 18:078,53080,709,48469,589,0001,217,0002,113,536
5Jul 31, 2026 18:078,53480,742,01469,625,0001,209,0002,113,536
6Jul 31, 2026 18:078,54380,928,66269,678,0001,235,0002,113,536
7Jul 31, 2026 18:078,54580,917,12169,710,0001,215,0002,113,536
8Jul 31, 2026 18:078,56481,016,06569,881,0001,201,0002,113,536
9Jul 31, 2026 18:078,63181,691,87770,450,0001,194,0002,113,536