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 8, 2026 22:46wnwnScore: 4,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 22:464,35361,633,51134,125,0002,007,0002,273,280
2Mar 8, 2026 22:464,36760,931,09635,239,0001,006,0002,494,464
3Mar 8, 2026 22:464,37055,953,47135,261,0001,007,0002,498,560
4Mar 8, 2026 22:474,37057,834,14435,265,0001,007,0002,273,280
5Mar 8, 2026 22:474,37156,110,45135,270,0001,007,0002,273,280
6Mar 8, 2026 22:474,40963,797,18935,576,0001,016,0002,502,656
7Mar 8, 2026 22:474,42063,757,73135,666,0001,019,0002,490,368
8Mar 8, 2026 22:474,43263,755,27134,798,0001,988,0002,531,328
9Mar 8, 2026 22:474,43863,684,64134,848,0001,991,0002,494,464
10Mar 8, 2026 22:474,43960,846,33634,854,0001,991,0002,490,368
11Mar 8, 2026 22:474,44556,932,86234,901,0001,994,0002,490,368
12Mar 8, 2026 22:4710,652108,872,02387,411,0001,004,0002,273,280