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 23, 2026 20:13Victor MerckléVictor MerckléScore: 3,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 20:143,78139,778,65430,346,0001,042,0002,117,632stderr
2Aug 23, 2026 20:143,79639,930,28830,374,0001,140,0002,117,632stderr
3Aug 23, 2026 20:143,83241,337,35930,738,0001,074,0002,117,632stderr
4Aug 23, 2026 20:143,83940,273,42030,770,0001,096,0002,117,632stderr
5Aug 23, 2026 20:143,86540,454,70930,983,0001,102,0002,117,632stderr
6Aug 23, 2026 20:143,91941,002,27631,422,0001,107,0002,117,632stderr
7Aug 23, 2026 20:143,94641,122,69231,633,0001,119,0002,117,632stderr
8Aug 23, 2026 20:144,12242,606,58533,164,0001,056,0002,117,632stderr
9Aug 23, 2026 20:144,13742,735,64533,265,0001,074,0002,117,632stderr