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 listFeb 16, 2026 09:54tch1001tch1001Score: 70,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 09:5470,003609,047,661578,028,0003,000,0002,404,352
2Feb 16, 2026 09:5470,003614,474,857579,025,0002,000,0002,273,280
3Feb 16, 2026 09:5470,007605,923,353580,058,0001,000,0002,400,256
4Feb 16, 2026 09:5470,007610,988,509581,058,00002,265,088
5Feb 16, 2026 09:5470,011602,871,525580,094,0001,000,0002,273,280
6Feb 16, 2026 09:5470,013609,280,102581,104,00002,273,280
7Feb 16, 2026 09:5470,013602,256,245579,107,0002,000,0002,273,280
8Feb 16, 2026 09:5470,024607,686,418581,202,00002,273,280
9Feb 16, 2026 09:5470,026607,394,574581,216,00002,404,352