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 listMar 17, 2026 08:45limanjun99limanjun99Score: 9,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 08:459,41998,777,07176,170,0002,004,0002,367,488
2Mar 17, 2026 08:459,430100,397,15376,262,0002,006,0002,289,664
3Mar 17, 2026 08:459,475110,022,85378,641,00002,486,272
4Mar 17, 2026 08:459,488104,426,90477,754,000996,0002,289,664
5Mar 17, 2026 08:459,489107,131,05778,761,00002,494,464
6Mar 17, 2026 08:459,517105,755,58677,994,000999,0002,289,664
7Mar 17, 2026 08:459,529105,480,30677,091,0002,002,0002,494,464
8Mar 17, 2026 08:459,584111,851,47477,531,0002,013,0002,289,664
9Mar 17, 2026 08:459,617110,627,25176,831,0002,993,0002,289,664