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 03:40Daniel MastalerzDaniel MastalerzScore: 6,933Success
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 03:406,64577,488,53449,138,0006,017,0002,482,176
2Feb 18, 2026 03:406,65483,233,78948,199,0007,029,0002,404,352
3Feb 18, 2026 03:406,71087,315,80443,545,00012,152,0002,359,296
4Feb 18, 2026 03:406,93389,130,55950,481,0007,067,0002,338,816
5Feb 18, 2026 03:406,94185,463,33550,536,0007,075,0002,400,256
6Feb 18, 2026 03:407,05180,271,71351,458,0007,062,0002,420,736