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 listApr 26, 2026 19:13olliecrowolliecrowScore: 8,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 19:158,60188,687,17768,380,0003,016,0002,441,216
2Apr 26, 2026 19:158,64979,014,92967,801,0003,988,0002,555,904
3Apr 26, 2026 19:158,69280,349,71568,137,0004,008,0002,461,696
4Apr 26, 2026 19:158,69379,444,45168,146,0004,008,0002,506,752
5Apr 26, 2026 19:158,70579,465,86169,246,0003,010,0002,355,200
6Apr 26, 2026 19:158,84281,593,76968,368,0005,027,0002,514,944
7Apr 26, 2026 19:158,89881,167,98969,866,0003,992,0002,310,144
8Apr 26, 2026 19:159,17684,448,85773,156,0003,006,0002,539,520
9Apr 26, 2026 19:159,22084,653,80274,520,0002,014,0002,551,808