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 25, 2026 22:19Victor MerckléVictor MerckléScore: 4,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:204,17642,250,75733,569,0001,095,0002,113,536
2Jun 25, 2026 22:204,18342,247,47033,635,0001,087,0002,113,536
3Jun 25, 2026 22:204,19342,375,56833,746,0001,064,0002,113,536
4Jun 25, 2026 22:204,19442,372,35633,717,0001,094,0002,113,536
5Jun 25, 2026 22:204,19442,486,10133,713,0001,100,0002,113,536
6Jun 25, 2026 22:204,19842,438,37433,742,0001,107,0002,113,536
7Jun 25, 2026 22:204,20242,480,76833,789,0001,094,0002,113,536
8Jun 25, 2026 22:204,24643,163,31134,157,0001,090,0002,113,536
9Jun 25, 2026 22:204,44844,433,64235,896,0001,026,0002,113,536