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 13, 2026 13:51Victor MerckléVictor MerckléScore: 7,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 13:527,88472,886,79864,394,0001,044,0002,113,536
2May 13, 2026 13:527,89074,885,96464,443,0001,046,0002,113,536
3May 13, 2026 13:527,89074,490,47664,449,0001,043,0002,113,536
4May 13, 2026 13:527,89175,310,07664,480,0001,022,0002,113,536
5May 13, 2026 13:527,89575,516,93264,490,0001,044,0002,113,536
6May 13, 2026 13:527,90673,190,63164,582,0001,046,0002,113,536
7May 13, 2026 13:527,90674,965,35164,552,0001,076,0002,113,536
8May 13, 2026 13:527,90774,750,95164,581,0001,052,0002,113,536
9May 13, 2026 13:527,94476,124,57264,907,0001,029,0002,113,536