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 10, 2026 05:08Josu San MartinJosu San MartinScore: 4,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 05:084,09251,878,78532,850,0001,119,0002,482,176
2May 10, 2026 05:084,09852,077,79832,889,0001,128,0002,482,176
3May 10, 2026 05:084,10451,170,32932,910,0001,158,0002,486,272
4May 10, 2026 05:084,10848,531,08932,990,0001,112,0002,482,176
5May 10, 2026 05:084,10951,251,20032,999,0001,112,0002,494,464
6May 10, 2026 05:084,12552,548,26433,096,0001,147,0002,494,464
7May 10, 2026 05:084,12749,293,22233,202,0001,057,0002,486,272
8May 10, 2026 05:084,12851,869,12633,211,0001,056,0002,490,368
9May 10, 2026 05:084,13052,171,17733,113,0001,172,0002,490,368