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 listMay 13, 2026 18:30Aleksei ShahoikaAleksei ShahoikaScore: 14,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:3014,049125,338,26193,688,00022,920,0002,113,536
2May 13, 2026 18:3014,070125,729,14094,029,00022,757,0002,113,536
3May 13, 2026 18:3014,086127,640,57093,900,00023,020,0002,113,536
4May 13, 2026 18:3014,150126,170,60994,317,00023,134,0002,113,536
5May 13, 2026 18:3014,177128,466,93694,920,00022,757,0002,113,536
6May 13, 2026 18:3014,250127,441,75695,136,00023,143,0002,113,536
7May 13, 2026 18:3014,367129,767,97996,631,00022,623,0002,113,536
8May 13, 2026 18:3014,378128,980,10494,808,00024,533,0002,113,536
9May 13, 2026 18:3014,505129,612,58797,033,00023,363,0002,113,536