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 listSep 7, 2026 15:17Kevin PetersKevin PetersScore: 81,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1781,264684,827,849617,046,00057,448,0002,113,536
2Sep 7, 2026 15:1781,289684,646,808616,840,00057,866,0002,113,536
3Sep 7, 2026 15:1781,292684,766,504617,005,00057,723,0002,113,536
4Sep 7, 2026 15:1781,294685,237,748617,016,00057,726,0002,113,536
5Sep 7, 2026 15:1781,303684,691,378617,022,00057,796,0002,113,536
6Sep 7, 2026 15:1781,334685,113,333616,951,00058,123,0002,113,536
7Sep 7, 2026 15:1781,364685,254,083616,938,00058,384,0002,113,536
8Sep 7, 2026 15:1781,431685,833,424617,074,00058,806,0002,113,536
9Sep 7, 2026 15:1781,545686,796,413616,908,00059,919,0002,113,536