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 17, 2026 22:18Daniel MastalerzDaniel MastalerzScore: 6,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:186,52078,124,41152,114,0002,004,0002,523,136
2Feb 17, 2026 22:186,52376,154,82751,131,0003,007,0002,301,952
3Feb 17, 2026 22:186,52679,753,62153,163,0001,003,0002,301,952
4Feb 17, 2026 22:186,65684,127,79455,245,00002,273,280
5Feb 17, 2026 22:186,65784,208,19953,242,0002,009,0002,293,760
6Feb 17, 2026 22:186,67977,867,54253,420,0002,015,0002,273,280