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 11, 2026 22:15olliecrowolliecrowScore: 6,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 22:156,14981,539,77448,035,0003,002,0002,490,368
2Feb 11, 2026 22:156,18276,577,32748,289,0003,018,0002,473,984
3Feb 11, 2026 22:156,26179,907,18650,965,000999,0002,457,600
4Feb 11, 2026 22:156,48187,516,02248,814,0004,981,0002,379,776
5Feb 11, 2026 22:156,52080,377,31650,108,0004,008,0002,400,256
6Feb 11, 2026 22:156,62382,351,20951,973,0002,998,0002,465,792