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 10, 2026 21:40Daniel MastalerzDaniel MastalerzScore: 6,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:406,37484,581,10550,910,0001,996,0002,420,736
2Mar 10, 2026 21:376,37577,005,45550,919,0001,996,0002,445,312
3Mar 10, 2026 21:376,41576,909,94849,225,0004,018,0002,285,568
4Mar 10, 2026 21:406,42578,632,57750,313,0003,018,0002,285,568
5Mar 10, 2026 21:406,42973,441,96949,336,0004,027,0002,433,024
6Mar 10, 2026 21:376,43176,104,57950,357,0003,021,0002,285,568
7Mar 10, 2026 21:406,43171,368,65950,358,0003,021,0002,277,376
8Mar 10, 2026 21:406,45585,845,80351,553,0002,021,0002,265,088
9Mar 10, 2026 21:376,48681,200,30450,846,0002,990,0002,285,568
10Mar 10, 2026 21:376,49577,778,64249,913,0003,993,0002,367,488
11Mar 10, 2026 21:406,51876,716,35351,098,0003,005,0002,433,024
12Mar 10, 2026 21:376,53381,738,23151,208,0003,012,0002,375,680