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 19, 2026 06:56Victor MerckléVictor MerckléScore: 4,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 06:574,51545,167,44336,398,0001,078,0002,113,536
2Jun 19, 2026 06:574,51745,109,40036,419,0001,076,0002,113,536
3Jun 19, 2026 06:574,51845,471,62036,404,0001,099,0002,113,536
4Jun 19, 2026 06:574,52345,222,11936,473,0001,075,0002,113,536
5Jun 19, 2026 06:574,54545,364,77236,721,0001,008,0002,113,536
6Jun 19, 2026 06:574,57145,356,85836,907,0001,040,0002,113,536
7Jun 19, 2026 06:574,57245,537,85236,920,0001,028,0002,113,536
8Jun 19, 2026 06:574,57545,627,04736,968,0001,007,0002,113,536
9Jun 19, 2026 06:574,76447,197,31838,512,0001,036,0002,113,536