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 02:28Victor MerckléVictor MerckléScore: 15,361Success
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 02:2914,925131,807,481122,807,0001,076,0002,113,536
2Jun 29, 2026 02:2915,356135,379,513126,385,0001,076,0002,113,536
3Jun 29, 2026 02:2915,356135,352,326126,391,0001,065,0002,113,536
4Jun 29, 2026 02:2915,361135,405,654126,423,0001,074,0002,113,536
5Jun 29, 2026 02:2915,361135,439,588126,423,0001,077,0002,113,536
6Jun 29, 2026 02:2915,363135,382,843126,448,0001,071,0002,113,536
7Jun 29, 2026 02:2915,365135,441,112126,451,0001,084,0002,113,536
8Jun 29, 2026 02:2915,404135,743,947126,815,0001,041,0002,113,536
9Jun 29, 2026 02:2915,573137,265,257128,229,0001,028,0002,113,536