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 listJun 27, 2026 01:05Code HintsCode HintsScore: 7,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:057,05466,148,33355,400,0003,156,0002,113,536
2Jun 27, 2026 01:057,07066,148,75656,623,0002,066,0002,113,536
3Jun 27, 2026 01:057,07466,295,90555,641,0003,075,0002,113,536
4Jun 27, 2026 01:057,07966,301,77956,698,0002,063,0002,113,536
5Jun 27, 2026 01:057,08367,730,63755,725,0003,066,0002,113,536
6Jun 27, 2026 01:057,09666,428,48755,883,0003,014,0002,113,536
7Jun 27, 2026 01:057,12166,566,21456,028,0003,082,0002,113,536
8Jun 27, 2026 01:057,22267,896,74656,873,0003,072,0002,113,536
9Jun 27, 2026 01:057,27167,822,41658,304,0002,046,0002,113,536