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 25, 2026 02:55Victor MerckléVictor MerckléScore: 10,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:5610,01191,434,68482,013,0001,079,0002,117,632stderr
2Aug 25, 2026 02:5610,03392,799,92082,199,0001,079,0002,117,632stderr
3Aug 25, 2026 02:5610,03891,493,93582,244,0001,074,0002,117,632stderr
4Aug 25, 2026 02:5610,06491,968,57582,455,0001,082,0002,117,632stderr
5Aug 25, 2026 02:5610,07192,067,64682,512,0001,081,0002,117,632stderr
6Aug 25, 2026 02:5610,09392,200,63782,682,0001,093,0002,117,632stderr
7Aug 25, 2026 02:5610,11392,368,93782,835,0001,104,0002,117,632stderr
8Aug 25, 2026 02:5610,11692,340,86182,866,0001,101,0002,117,632stderr
9Aug 25, 2026 02:5610,12092,375,39782,907,0001,092,0002,117,632stderr