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 24, 2026 15:49Victor MerckléVictor MerckléScore: 13,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:5013,433119,919,766110,421,0001,077,0002,113,536
2May 24, 2026 15:5013,441120,009,221110,491,0001,074,0002,113,536
3May 24, 2026 15:5013,470120,531,218110,758,0001,044,0002,113,536
4May 24, 2026 15:5013,470119,618,896110,788,0001,020,0002,113,536
5May 24, 2026 15:5013,471121,370,279110,809,0001,006,0002,113,536
6May 24, 2026 15:5013,471121,179,983110,804,0001,012,0002,113,536
7May 24, 2026 15:5013,478119,663,769110,867,0001,008,0002,113,536
8May 24, 2026 15:5013,887124,354,714114,197,0001,070,0002,113,536
9May 24, 2026 15:5013,938123,915,442114,656,0001,036,0002,113,536