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 31, 2026 12:07boop34boop34Score: 8,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 12:078,37379,490,33168,271,0001,228,0002,113,536
2Jul 31, 2026 12:078,39879,670,47668,501,0001,203,0002,113,536
3Jul 31, 2026 12:078,42079,768,58468,686,0001,204,0002,113,536
4Jul 31, 2026 12:078,44481,221,63868,973,0001,116,0002,113,536
5Jul 31, 2026 12:078,45380,113,17668,964,0001,196,0002,113,536
6Jul 31, 2026 12:078,46480,246,38869,053,0001,201,0002,113,536
7Jul 31, 2026 12:078,47380,348,68169,202,0001,126,0002,113,536
8Jul 31, 2026 12:078,47780,239,71069,234,0001,128,0002,113,536
9Jul 31, 2026 12:078,48180,391,30169,387,0001,008,0002,113,536