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 16, 2026 11:11Eric CeglieEric CeglieScore: 8,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:118,823101,549,66270,226,0003,009,0002,494,464
2Mar 16, 2026 11:118,82798,237,08370,251,0003,010,0002,289,664
3Mar 16, 2026 11:118,85097,726,67372,447,0001,006,0002,289,664
4Mar 16, 2026 11:118,922101,544,59972,053,0002,001,0002,289,664
5Mar 16, 2026 11:118,92596,471,40672,072,0002,002,0002,289,664
6Mar 16, 2026 11:118,945102,281,07871,234,0003,009,0002,498,560
7Mar 16, 2026 11:118,96796,747,21571,407,0003,017,0002,494,464
8Mar 16, 2026 11:118,97095,123,78274,454,00002,289,664
9Mar 16, 2026 11:119,03398,034,67271,976,0002,999,0002,355,200