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 18, 2026 10:28shartgepettoshartgepettoScore: 6,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:286,14377,885,06646,987,0003,998,0002,383,872
2Mar 18, 2026 10:286,14977,526,72548,037,0003,002,0002,469,888
3Mar 18, 2026 10:286,15975,304,81547,113,0004,009,0002,387,968
4Mar 18, 2026 10:286,16374,075,11248,143,0003,008,0002,363,392
5Mar 18, 2026 10:286,16777,505,26949,178,0002,007,0002,465,792
6Mar 18, 2026 10:286,17079,086,60848,199,0003,012,0002,428,928
7Mar 18, 2026 10:286,17469,879,92648,231,0003,014,0002,383,872
8Mar 18, 2026 10:286,21383,099,64647,523,0004,044,0002,486,272
9Mar 18, 2026 10:286,45982,031,53850,574,0003,034,0002,465,792