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 24, 2026 20:40Victor MerckléVictor MerckléScore: 3,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:413,74839,559,99629,900,0001,209,0002,117,632stderr
2Aug 24, 2026 20:413,75039,467,84929,997,0001,131,0002,117,632stderr
3Aug 24, 2026 20:413,75639,581,46830,037,0001,140,0002,117,632stderr
4Aug 24, 2026 20:413,76439,585,09030,175,0001,074,0002,117,632stderr
5Aug 24, 2026 20:413,76639,656,89030,160,0001,104,0002,117,632stderr
6Aug 24, 2026 20:413,78539,814,85230,318,0001,103,0002,117,632stderr
7Aug 24, 2026 20:413,78939,860,78830,364,0001,091,0002,117,632stderr
8Aug 24, 2026 20:413,79139,882,25430,391,0001,081,0002,117,632stderr
9Aug 24, 2026 20:414,17243,103,40033,511,0001,122,0002,117,632stderr