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 listJul 22, 2026 18:06Kasper KivimäkiKasper KivimäkiScore: 62,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:0662,145526,523,446460,344,00055,462,0002,113,536
2Jul 22, 2026 18:0662,146526,495,746460,339,00055,476,0002,113,536
3Jul 22, 2026 18:0662,201526,810,329460,719,00055,557,0002,113,536
4Jul 22, 2026 18:0662,211526,258,619460,835,00055,523,0002,113,536
5Jul 22, 2026 18:0662,232527,047,827461,031,00055,498,0002,113,536
6Jul 22, 2026 18:0662,267527,486,784460,308,00056,511,0002,113,536
7Jul 22, 2026 18:0662,270527,417,838460,321,00056,521,0002,113,536
8Jul 22, 2026 18:0662,342527,314,129460,934,00056,511,0002,113,536
9Jul 22, 2026 18:0662,516528,785,276461,327,00057,556,0002,113,536