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 listSep 1, 2026 07:07Victor MerckléVictor MerckléScore: 4,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:074,73148,274,70638,151,0001,123,0002,117,632stderr
2Sep 1, 2026 07:074,74047,701,33538,227,0001,117,0002,117,632stderr
3Sep 1, 2026 07:074,74847,797,33938,304,0001,108,0002,117,632stderr
4Sep 1, 2026 07:074,75647,876,13238,389,0001,093,0002,117,632stderr
5Sep 1, 2026 07:074,76147,937,09038,424,0001,099,0002,117,632stderr
6Sep 1, 2026 07:074,76447,941,66538,434,0001,115,0002,117,632stderr
7Sep 1, 2026 07:074,76647,980,35438,534,0001,027,0002,117,632stderr
8Sep 1, 2026 07:074,80748,296,21538,782,0001,121,0002,117,632stderr
9Sep 1, 2026 07:074,81848,414,56138,857,0001,139,0002,117,632stderr