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 12, 2026 08:46Victor MerckléVictor MerckléScore: 81,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 08:4781,255682,870,366668,943,0005,474,0002,117,632stderr
2Aug 12, 2026 08:4781,260682,820,977669,060,0005,398,0002,117,632stderr
3Aug 12, 2026 08:4781,323683,881,032669,333,0005,650,0002,117,632stderr
4Aug 12, 2026 08:4781,331683,530,834669,489,0005,562,0002,117,632stderr
5Aug 12, 2026 08:4781,618685,920,739671,705,0005,727,0002,117,632stderr
6Aug 12, 2026 08:4781,893688,164,916674,164,0005,549,0002,117,632stderr
7Aug 12, 2026 08:4782,135690,207,105676,219,0005,505,0002,117,632stderr
8Aug 12, 2026 08:4782,164690,464,783676,547,0005,417,0002,117,632stderr
9Aug 12, 2026 08:4782,175690,620,687675,936,0006,122,0002,117,632stderr