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 4, 2026 12:09Oleg SkinderevOleg SkinderevScore: 62,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 12:0961,421527,228,058508,797,0001,002,0002,514,944
2May 4, 2026 12:0961,570528,711,433510,037,0001,002,0002,519,040
3May 4, 2026 12:0961,852531,612,282512,368,0001,005,0002,502,656
4May 4, 2026 12:0962,291533,694,797516,017,0001,004,0002,510,848
5May 4, 2026 12:0962,434532,756,039517,028,0001,181,0002,506,752
6May 4, 2026 12:0962,578537,577,024518,201,0001,203,0002,510,848
7May 4, 2026 12:0962,654538,206,704519,028,0001,007,0002,514,944
8May 4, 2026 12:0962,654537,046,732519,028,0001,003,0002,510,848
9May 4, 2026 12:0962,656536,616,826519,048,0001,004,0002,506,752