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 listJan 5, 2026 21:14lipapipalipapipaScore: 67,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 21:1667,665584,988,295496,667,00064,956,000307,200
2Jan 5, 2026 20:5467,723587,764,430495,212,00066,893,000176,128
3Jan 5, 2026 21:1467,738589,913,417494,322,00067,906,000299,008
4Jan 5, 2026 20:5467,742587,998,004497,347,00064,914,0002,404,352
5Jan 5, 2026 21:1467,775591,695,046494,587,00067,943,0002,273,280
6Jan 5, 2026 21:1667,775590,801,542496,591,00065,945,0002,396,160
7Jan 5, 2026 21:1467,781588,269,816496,631,00065,951,0002,400,256
8Jan 5, 2026 20:5468,964602,129,574498,479,00073,922,000303,104
9Jan 5, 2026 21:1669,128595,309,806500,919,00072,842,000294,912