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 4, 2026 00:15Josu San MartinJosu San MartinScore: 20,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:1520,662181,082,405170,491,0001,008,0002,113,536
2Jul 4, 2026 00:1520,667181,264,924170,531,0001,009,0002,113,536
3Jul 4, 2026 00:1520,671181,087,494170,564,0001,009,0002,113,536
4Jul 4, 2026 00:1520,678181,178,674170,624,0001,010,0002,113,536
5Jul 4, 2026 00:1520,691181,313,207170,731,0001,010,0002,113,536
6Jul 4, 2026 00:1520,695182,728,584170,761,0001,011,0002,113,536
7Jul 4, 2026 00:1520,699181,428,770170,799,0001,010,0002,113,536
8Jul 4, 2026 00:1520,699181,351,209170,797,0001,009,0002,113,536
9Jul 4, 2026 00:1520,702181,851,049170,822,0001,010,0002,113,536