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 listMay 25, 2026 19:45Maya RebholzMaya RebholzScore: 5,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 19:465,80758,361,96642,964,0005,236,0002,113,536
2May 25, 2026 19:465,92162,161,09143,713,0005,439,0002,113,536
3May 25, 2026 19:465,98259,572,43444,091,0005,562,0002,113,536
4May 25, 2026 19:465,98660,037,34344,239,0005,452,0002,117,632
5May 25, 2026 19:465,98760,679,45644,167,0005,526,0002,113,536
6May 25, 2026 19:466,01862,370,70144,447,0005,507,0002,117,632
7May 25, 2026 19:466,05762,734,13444,739,0005,537,0002,117,632
8May 25, 2026 19:466,06561,963,25144,750,0005,592,0002,113,536
9May 25, 2026 19:466,28162,806,44946,365,0005,768,0002,117,632