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 listApr 30, 2026 00:30olliecrowolliecrowScore: 8,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 00:328,49778,721,80666,502,0004,030,0002,461,696
2Apr 30, 2026 00:328,54079,067,69168,889,0001,996,0002,375,680
3Apr 30, 2026 00:328,58878,661,75165,262,0006,024,0002,478,080
4Apr 30, 2026 00:328,61179,698,65668,457,0003,020,0002,330,624
5Apr 30, 2026 00:328,62279,794,94868,543,0003,023,0002,314,240
6Apr 30, 2026 00:328,63079,847,03768,607,0003,026,0002,441,216
7Apr 30, 2026 00:328,65279,905,71069,822,0001,994,0002,322,432
8Apr 30, 2026 00:329,02991,160,51371,948,0002,997,0002,560,000
9Apr 30, 2026 00:329,11783,972,30573,686,0001,991,0002,375,680