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 01:58Victor MerckléVictor MerckléScore: 3,909Success
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 01:593,89141,259,72931,173,0001,127,0002,113,536
2Aug 27, 2026 01:593,89240,634,93331,127,0001,178,0002,113,536
3Aug 27, 2026 01:593,89240,618,35131,040,0001,266,0002,113,536
4Aug 27, 2026 01:593,89840,699,43531,215,0001,141,0002,113,536
5Aug 27, 2026 01:593,90940,791,29831,317,0001,129,0002,113,536
6Aug 27, 2026 01:593,92940,911,50031,497,0001,116,0002,113,536
7Aug 27, 2026 01:593,93141,612,50031,426,0001,207,0002,113,536
8Aug 27, 2026 01:594,00841,567,92832,156,0001,116,0002,113,536
9Aug 27, 2026 01:594,10442,364,93133,016,0001,054,0002,113,536