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 8, 2026 15:40Alexander StanovoyAlexander StanovoyScore: 38,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 15:4038,401328,493,010317,692,0001,042,0002,113,536
2Jul 8, 2026 15:4038,403328,408,802317,555,0001,197,0002,113,536
3Jul 8, 2026 15:4038,405328,427,384317,565,0001,197,0002,113,536
4Jul 8, 2026 15:4038,407328,387,824317,594,0001,190,0002,113,536
5Jul 8, 2026 15:4038,409328,413,779317,616,0001,180,0002,113,536
6Jul 8, 2026 15:4038,413328,489,834317,782,0001,052,0002,113,536
7Jul 8, 2026 15:4038,427329,256,322317,885,0001,067,0002,113,536
8Jul 8, 2026 15:4038,436328,686,863317,991,0001,034,0002,113,536
9Jul 8, 2026 15:4038,843332,580,132321,137,0001,264,0002,113,536