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 listOct 5, 2026 02:35FrederickFrederickScore: 7,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:357,09670,115,00256,876,0002,029,0002,113,536
2Oct 5, 2026 02:357,18770,862,60057,645,0002,014,0002,113,536
3Oct 5, 2026 02:357,28270,951,20459,414,0001,030,0002,113,536
4Oct 5, 2026 02:357,29271,729,32058,503,0002,024,0002,113,536
5Oct 5, 2026 02:357,31871,866,89358,722,0002,024,0002,113,536
6Oct 5, 2026 02:357,35271,476,19959,010,0002,014,0002,113,536
7Oct 5, 2026 02:357,40572,602,22059,441,0002,022,0002,113,536
8Oct 5, 2026 02:357,43672,795,97960,710,0001,016,0002,113,536
9Oct 5, 2026 02:357,45672,676,80759,864,0002,023,0002,113,536