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 listFeb 21, 2026 23:42Mathaus Adorno PereiraMathaus Adorno PereiraScore: 217,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 23:42217,2831,824,616,4291,800,447,0002,999,0002,322,432
2Feb 21, 2026 23:42217,3611,831,217,9751,801,100,0002,998,0002,330,624
3Feb 21, 2026 23:42217,3801,829,345,2071,801,255,0002,998,0002,322,432
4Feb 21, 2026 23:42217,4001,827,062,4071,801,424,0002,999,0002,330,624
5Feb 21, 2026 23:42217,4211,830,330,3221,801,598,0002,997,0002,322,432
6Feb 21, 2026 23:42217,4491,831,647,8321,802,829,0001,998,0002,330,624
7Feb 21, 2026 23:42217,4701,830,127,4651,803,005,0001,998,0002,330,624
8Feb 21, 2026 23:42217,4711,835,899,0521,803,012,0001,998,0002,371,584
9Feb 21, 2026 23:42217,4731,836,351,3621,801,031,0003,997,0002,330,624