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 29, 2026 15:44Saif Al-HarthiSaif Al-HarthiScore: 18,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 15:4518,614163,813,750153,494,0001,006,0002,113,536
2Jun 29, 2026 15:4518,620164,506,827153,543,0001,006,0002,113,536
3Jun 29, 2026 15:4518,621163,965,329153,551,0001,006,0002,113,536
4Jun 29, 2026 15:4518,625164,031,497153,589,0001,006,0002,113,536
5Jun 29, 2026 15:4518,635163,962,077153,668,0001,005,0002,113,536
6Jun 29, 2026 15:4518,642164,002,404153,730,0001,006,0002,113,536
7Jun 29, 2026 15:4518,724164,759,967154,409,0001,006,0002,113,536
8Jun 29, 2026 15:4518,748164,929,429154,604,0001,007,0002,113,536
9Jun 29, 2026 15:4518,955166,710,594156,325,0001,005,0002,113,536