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:24George SeabridgeGeorge SeabridgeScore: 8,814Success
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:248,76082,327,55871,692,0001,016,0002,117,632
2Jul 31, 2026 18:248,79182,607,90671,960,0001,010,0002,117,632
3Jul 31, 2026 18:248,80482,775,53772,069,0001,011,0002,117,632
4Jul 31, 2026 18:248,80982,796,33472,113,0001,004,0002,117,632
5Jul 31, 2026 18:248,81482,819,36172,136,0001,022,0002,117,632
6Jul 31, 2026 18:248,83983,026,71072,361,0001,006,0002,117,632
7Jul 31, 2026 18:248,86883,326,96172,597,0001,014,0002,117,632
8Jul 31, 2026 18:248,87084,825,99272,615,0001,007,0002,117,632
9Jul 31, 2026 18:248,89083,471,94672,774,0001,021,0002,117,632