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 8, 2026 01:24Victor MerckléVictor MerckléScore: 3,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 01:273,51337,676,32328,139,0001,025,0002,117,632stderr
2Sep 8, 2026 01:273,52939,129,50028,277,0001,021,0002,117,632stderr
3Sep 8, 2026 01:273,53937,857,95528,365,0001,013,0002,117,632stderr
4Sep 8, 2026 01:273,61238,516,91028,968,0001,013,0002,117,632stderr
5Sep 8, 2026 01:273,62138,577,27929,046,0001,009,0002,117,632stderr
6Sep 8, 2026 01:273,62339,258,70129,050,0001,025,0002,117,632stderr
7Sep 8, 2026 01:273,62838,877,90029,088,0001,032,0002,117,632stderr
8Sep 8, 2026 01:273,63438,667,04129,150,0001,014,0002,117,632stderr
9Sep 8, 2026 01:273,63939,440,61529,180,0001,031,0002,117,632stderr