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 listFeb 18, 2026 00:53Daniel MastalerzDaniel MastalerzScore: 7,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:537,10385,794,16655,959,0002,997,0002,306,048
2Feb 18, 2026 00:537,10781,182,48654,987,0003,999,0002,322,432
3Feb 18, 2026 00:537,12486,551,72556,121,0003,006,0002,310,144
4Feb 18, 2026 00:537,25886,840,79056,227,0004,016,0002,301,952
5Feb 18, 2026 00:537,27288,374,57056,333,0004,023,0002,318,336
6Feb 18, 2026 00:537,27685,391,41958,375,0002,012,0002,285,568