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 listMar 6, 2026 18:20wnwnScore: 4,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:204,33355,715,57333,969,0001,998,0002,273,280
2Mar 6, 2026 18:204,35758,441,14734,153,0002,009,0002,273,280
3Mar 6, 2026 18:204,38257,285,81535,362,0001,010,0002,273,280
4Mar 6, 2026 18:204,39057,239,49935,422,0001,012,0002,273,280
5Mar 6, 2026 18:204,39263,008,31835,445,0001,012,0002,490,368
6Mar 6, 2026 18:204,39457,605,82935,457,0001,013,0002,273,280
7Mar 6, 2026 18:204,40455,016,65835,540,0001,015,0002,490,368
8Mar 6, 2026 18:204,41958,637,49235,662,0001,018,0002,490,368
9Mar 6, 2026 18:204,41960,778,11135,657,0001,018,0002,490,368