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 12:20Victor MerckléVictor MerckléScore: 4,242Success
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 12:214,20342,490,29933,808,0001,085,0002,113,536
2Jun 25, 2026 12:214,21642,580,04833,917,0001,080,0002,113,536
3Jun 25, 2026 12:214,22442,618,12133,970,0001,096,0002,113,536
4Jun 25, 2026 12:214,23042,677,91534,078,0001,032,0002,113,536
5Jun 25, 2026 12:214,24242,797,08934,118,0001,093,0002,113,536
6Jun 25, 2026 12:214,26242,949,92634,373,0001,006,0002,113,536
7Jun 25, 2026 12:214,32144,789,76834,773,0001,096,0002,113,536
8Jun 25, 2026 12:214,34143,629,17034,938,0001,095,0002,113,536
9Jun 25, 2026 12:214,42744,340,31135,704,0001,043,0002,113,536