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 15, 2026 18:14boop34boop34Score: 11,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:1511,269103,886,97292,524,0001,011,0002,113,536
2Jul 15, 2026 18:1511,270103,346,06492,470,0001,074,0002,113,536
3Jul 15, 2026 18:1511,277103,384,13292,553,0001,050,0002,113,536
4Jul 15, 2026 18:1511,279104,657,37192,548,0001,071,0002,113,536
5Jul 15, 2026 18:1511,280104,023,03792,616,0001,009,0002,113,536
6Jul 15, 2026 18:1511,284104,061,49492,597,0001,068,0002,113,536
7Jul 15, 2026 18:1511,295103,479,49692,705,0001,049,0002,113,536
8Jul 15, 2026 18:1511,306104,169,63992,737,0001,109,0002,113,536
9Jul 15, 2026 18:1511,321103,709,56592,920,0001,047,0002,113,536