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 20, 2026 02:40Victor MerckléVictor MerckléScore: 15,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 02:4115,144133,351,262124,637,0001,065,0002,113,536
2Jun 20, 2026 02:4115,149133,366,480124,683,0001,056,0002,113,536
3Jun 20, 2026 02:4115,150133,423,240124,688,0001,061,0002,113,536
4Jun 20, 2026 02:4115,165133,468,057124,809,0001,064,0002,113,536
5Jun 20, 2026 02:4115,168133,603,653124,846,0001,052,0002,113,536
6Jun 20, 2026 02:4115,169133,614,590124,835,0001,073,0002,113,536
7Jun 20, 2026 02:4115,222133,983,523125,262,0001,082,0002,113,536
8Jun 20, 2026 02:4115,286134,572,445125,879,0001,002,0002,113,536
9Jun 20, 2026 02:4115,405135,500,745126,833,0001,036,0002,113,536