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 listNov 15, 2026 19:20Genos0Genos0Score: 56,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2026 19:2155,525471,687,982459,805,0001,056,0002,113,536
2Nov 15, 2026 19:2155,526472,234,388459,806,0001,065,0002,113,536
3Nov 15, 2026 19:2155,530472,221,435459,835,0001,070,0002,113,536
4Nov 15, 2026 19:2155,537472,316,477459,878,0001,083,0002,113,536
5Nov 15, 2026 19:2156,105478,108,664464,672,0001,002,0002,113,536
6Nov 15, 2026 19:2156,308478,713,077466,351,0001,007,0002,113,536
7Nov 15, 2026 19:2156,319478,911,181466,446,0001,004,0002,113,536
8Nov 15, 2026 19:2156,829483,101,226470,617,0001,070,0002,113,536
9Nov 15, 2026 19:2156,859484,425,842470,827,0001,108,0002,113,536