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 19, 2026 18:55Daniel MastalerzDaniel MastalerzScore: 6,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 18:556,26476,817,01547,992,0003,999,0002,273,280
2Feb 19, 2026 18:556,26876,398,09648,020,0004,001,0002,310,144
3Feb 19, 2026 18:556,29476,785,46548,223,0004,018,0002,285,568
4Feb 19, 2026 18:556,38279,281,77749,974,0002,998,0002,285,568
5Feb 19, 2026 18:556,38378,728,45748,981,0003,998,0002,519,040
6Feb 19, 2026 18:556,39677,053,77549,082,0004,006,0002,265,088