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 11, 2026 15:44Victor MerckléVictor MerckléScore: 42,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 15:5142,737363,440,608353,461,0001,259,00024,576stderr
2Sep 11, 2026 15:5142,750363,516,062353,775,0001,058,00024,576stderr
3Sep 11, 2026 15:5142,752364,253,064353,762,0001,080,00024,576stderr
4Sep 11, 2026 15:5142,792364,462,529353,933,0001,245,00024,576stderr
5Sep 11, 2026 15:5142,801364,599,328354,217,0001,036,00024,576stderr
6Sep 11, 2026 15:5142,832364,378,144353,353,0002,159,0002,117,632stderr
7Sep 11, 2026 15:5142,868365,270,050354,809,0001,003,00024,576stderr
8Sep 11, 2026 15:5142,931365,165,680355,314,0001,015,00024,576stderr
9Sep 11, 2026 15:5142,959365,899,499355,565,0001,001,00024,576stderr