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 13, 2026 18:23boop34boop34Score: 22,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 18:2422,011192,580,713181,681,0001,011,0002,113,536
2Jul 13, 2026 18:2422,014192,464,970181,711,0001,011,0002,113,536
3Jul 13, 2026 18:2422,015192,446,925181,720,0001,011,0002,113,536
4Jul 13, 2026 18:2422,016193,121,327181,725,0001,011,0002,113,536
5Jul 13, 2026 18:2422,020192,529,265181,760,0001,009,0002,113,536
6Jul 13, 2026 18:2422,023192,582,588181,785,0001,010,0002,113,536
7Jul 13, 2026 18:2422,024193,075,943181,792,0001,012,0002,113,536
8Jul 13, 2026 18:2422,036192,675,319180,875,0002,024,0002,113,536
9Jul 13, 2026 18:2422,086193,650,406182,304,0001,011,0002,113,536