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 listMay 21, 2026 12:37Victor MerckléVictor MerckléScore: 4,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:384,78748,162,20638,662,0001,075,0002,113,536
2May 21, 2026 12:384,79247,588,30738,703,0001,076,0002,113,536
3May 21, 2026 12:384,80448,039,87438,848,0001,032,0002,113,536
4May 21, 2026 12:384,81448,623,97238,920,0001,040,0002,113,536
5May 21, 2026 12:384,82348,063,22239,001,0001,036,0002,113,536
6May 21, 2026 12:384,83747,979,89739,102,0001,047,0002,113,536
7May 21, 2026 12:384,87848,344,79239,419,0001,074,0002,113,536
8May 21, 2026 12:384,89748,515,27439,594,0001,058,0002,113,536
9May 21, 2026 12:385,01151,265,81340,593,0001,002,0002,113,536