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 listMay 5, 2026 17:01flavio87flavio87Score: 19,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 17:0118,865172,396,065154,400,0002,180,0002,412,544
2May 5, 2026 17:0118,994174,551,614155,453,0002,204,0002,396,160
3May 5, 2026 17:0119,042175,521,605155,782,0002,270,0002,371,584
4May 5, 2026 17:0119,048172,209,094155,923,0002,182,0002,420,736
5May 5, 2026 17:0119,163178,321,948156,787,0002,272,0002,383,872
6May 5, 2026 17:0119,301178,401,650158,057,0002,147,0002,387,968
7May 5, 2026 17:0119,301176,882,996158,189,0002,013,0002,293,760
8May 5, 2026 17:0119,448179,438,293159,269,0002,152,0002,400,256
9May 5, 2026 17:0119,665182,127,933161,030,0002,196,0002,396,160