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 24, 2026 16:37Daniel MastalerzDaniel MastalerzScore: 8,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:378,32995,985,03564,118,0005,009,0002,269,184
2Feb 24, 2026 16:378,330104,574,73164,133,0005,010,0002,310,144
3Feb 24, 2026 16:378,34489,372,61564,240,0005,018,0002,371,584
4Feb 24, 2026 16:378,44496,475,22365,077,0005,005,0002,301,952
5Feb 24, 2026 16:378,50598,756,70466,560,0004,033,0002,322,432
6Feb 24, 2026 16:378,68290,812,80865,055,0007,005,0002,519,040