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 listFeb 21, 2026 03:49MathSOMathSOScore: 3,008,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 03:493,005,73024,990,385,50724,839,627,000107,928,0002,285,568
2Feb 21, 2026 03:493,005,91024,995,259,37624,833,123,000115,930,0002,387,968
3Feb 21, 2026 03:493,007,67225,005,246,40524,841,749,000121,930,0002,465,792
4Feb 21, 2026 03:493,008,31325,017,627,73224,873,046,00095,950,0002,379,776
5Feb 21, 2026 03:493,008,82025,020,112,50324,858,297,000114,913,0002,453,504
6Feb 21, 2026 03:493,009,34825,020,709,57724,882,645,00094,945,0002,351,104
7Feb 21, 2026 03:493,009,58525,023,135,00924,868,622,000110,931,0002,322,432
8Feb 21, 2026 03:493,010,60125,029,972,86624,878,061,000109,925,0002,473,984
9Feb 21, 2026 03:493,013,31525,054,699,41924,908,573,000101,940,0002,367,488