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 6, 2026 23:07Victor MerckléVictor MerckléScore: 4,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:084,76749,123,56838,437,0001,136,0002,117,632stderr
2Jul 6, 2026 23:084,77648,501,97038,524,0001,121,0002,117,632stderr
3Jul 6, 2026 23:084,77847,565,54238,538,0001,126,0002,117,632stderr
4Jul 6, 2026 23:084,79148,173,09638,751,0001,016,0002,117,632stderr
5Jul 6, 2026 23:084,79448,415,27038,778,0001,013,0002,117,632stderr
6Jul 6, 2026 23:084,79948,434,90638,655,0001,183,0002,117,632stderr
7Jul 6, 2026 23:084,80148,277,03138,719,0001,137,0002,117,632stderr
8Jul 6, 2026 23:084,80648,283,15338,783,0001,111,0002,117,632stderr
9Jul 6, 2026 23:084,80748,460,81338,777,0001,123,0002,117,632stderr