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 30, 2026 18:47Anurag ChoubeyAnurag ChoubeyScore: 89,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:4789,125750,404,141681,313,00058,427,0002,113,536
2Aug 30, 2026 18:4789,150750,795,036681,462,00058,487,0002,113,536
3Aug 30, 2026 18:4789,167750,772,306681,300,00058,792,0002,113,536
4Aug 30, 2026 18:4789,182751,032,183681,546,00058,666,0002,113,536
5Aug 30, 2026 18:4789,188750,872,087681,502,00058,764,0002,113,536
6Aug 30, 2026 18:4789,189750,919,611681,683,00058,592,0002,113,536
7Aug 30, 2026 18:4789,190751,037,792681,363,00058,916,0002,113,536
8Aug 30, 2026 18:4789,226751,133,797681,735,00058,845,0002,113,536
9Aug 30, 2026 18:4789,256751,384,295681,626,00059,205,0002,113,536