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 listJan 30, 2026 02:40Josu San MartinJosu San MartinScore: 6,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 02:395,83174,186,53148,395,00002,441,216
2Jan 30, 2026 02:405,90275,553,74146,988,0001,999,0002,437,120
3Jan 30, 2026 02:395,94670,619,03048,345,0001,007,0002,441,216
4Jan 30, 2026 02:395,98080,110,96448,618,0001,012,0002,441,216
5Jan 30, 2026 02:396,00171,847,82048,812,000996,0002,449,408
6Jan 30, 2026 02:396,07671,692,27849,420,0001,008,0002,437,120
7Jan 30, 2026 02:396,08075,374,51249,454,0001,009,0002,441,216
8Jan 30, 2026 02:406,10376,176,43048,672,0001,986,0002,281,472
9Jan 30, 2026 02:406,18078,049,72050,291,0001,005,0002,445,312
10Jan 30, 2026 02:406,19772,970,02149,422,0002,017,0002,285,568
11Jan 30, 2026 02:406,20473,898,95350,484,0001,009,0002,437,120
12Jan 30, 2026 02:406,20774,670,20650,508,0001,010,0002,441,216