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 23:14MathSOMathSOScore: 190,596Success
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 23:14190,2241,609,059,7941,489,926,00088,935,0002,363,392
2Feb 21, 2026 23:14190,2741,607,726,8121,495,317,00083,961,0002,322,432
3Feb 21, 2026 23:14190,3301,609,124,9881,495,803,00083,932,0002,330,624
4Feb 21, 2026 23:14190,3811,611,313,9791,490,214,00089,952,0002,330,624
5Feb 21, 2026 23:14190,5961,611,573,6531,492,953,00088,997,0002,478,080
6Feb 21, 2026 23:14190,6371,612,413,8761,493,324,00088,959,0002,338,816
7Feb 21, 2026 23:14190,7031,612,045,7741,498,894,00083,938,0002,338,816
8Feb 21, 2026 23:14190,8781,612,840,0541,498,275,00086,015,0002,363,392
9Feb 21, 2026 23:14190,9911,611,408,6881,498,265,00086,957,0002,338,816