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 2, 2026 15:28caandocaandoScore: 6,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:286,01073,110,96747,885,0001,995,0002,285,568
2Mar 2, 2026 15:286,02773,158,10848,024,0002,001,0002,273,280
3Mar 2, 2026 15:286,03371,970,33148,069,0002,002,0002,523,136
4Mar 2, 2026 15:286,14377,941,26849,984,000999,0002,523,136
5Mar 2, 2026 15:286,15075,562,41749,044,0002,001,0002,285,568
6Mar 2, 2026 15:286,15675,040,55850,091,0001,001,0002,269,184