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 15, 2026 18:31Daniel MastalerzDaniel MastalerzScore: 6,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:316,59784,003,18450,777,0003,982,0002,289,664
2Feb 15, 2026 18:316,61277,140,07451,832,0003,048,0002,306,048
3Feb 15, 2026 18:316,63781,019,35451,083,0004,006,0002,306,048
4Feb 15, 2026 18:316,72681,700,57953,836,0001,993,0002,306,048
5Feb 15, 2026 18:316,73781,182,78451,922,0003,993,0002,260,992
6Feb 15, 2026 18:316,74677,066,77751,993,0003,999,0002,289,664