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 listAug 27, 2026 05:37Victor MerckléVictor MerckléScore: 58,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:3957,424485,089,540475,488,0001,133,0002,113,536
2Aug 27, 2026 05:3957,956490,139,376479,948,0001,090,0002,113,536
3Aug 27, 2026 05:3957,996489,935,904480,362,0001,005,0002,113,536
4Aug 27, 2026 05:3958,018490,660,178480,448,0001,109,0002,113,536
5Aug 27, 2026 05:3958,035490,867,058480,582,0001,109,0002,113,536
6Aug 27, 2026 05:3958,039490,222,607480,655,0001,072,0002,113,536
7Aug 27, 2026 05:3958,053491,086,572480,708,0001,138,0002,113,536
8Aug 27, 2026 05:3958,062491,197,123480,905,0001,017,0002,113,536
9Aug 27, 2026 05:3958,082491,310,313481,053,0001,035,0002,113,536