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 22, 2026 11:05wnwnScore: 3,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:053,41445,525,59527,328,0001,012,0002,486,272
2Apr 22, 2026 11:053,41744,676,02627,355,0001,013,0002,486,272
3Apr 22, 2026 11:053,43846,290,01527,521,0001,019,0002,486,272
4Apr 22, 2026 11:053,45243,925,53627,634,0001,023,0002,494,464
5Apr 22, 2026 11:053,46044,142,50227,728,000990,0002,482,176
6Apr 22, 2026 11:053,47244,703,12726,835,0001,987,0002,560,000
7Apr 22, 2026 11:053,47242,230,31826,831,0001,987,0002,482,176
8Apr 22, 2026 11:053,48047,702,27227,854,0001,031,0002,486,272
9Apr 22, 2026 11:053,63152,487,37229,141,0001,004,0002,482,176