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 2, 2026 12:48limanjun99limanjun99Score: 46,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 12:4946,050400,477,488380,218,0002,001,0002,469,888
2May 2, 2026 12:4946,057402,727,386380,273,0002,001,0002,473,984
3May 2, 2026 12:4946,060397,303,445381,300,0001,000,0002,465,792
4May 2, 2026 12:4946,060397,069,192380,305,0002,001,0002,519,040
5May 2, 2026 12:4946,070400,561,387380,383,0002,002,0002,461,696
6May 2, 2026 12:4946,071397,932,470380,393,0002,002,0002,342,912
7May 2, 2026 12:4946,074403,512,166380,420,0002,002,0002,465,792
8May 2, 2026 12:4946,081400,073,664379,480,0002,995,0002,453,504
9May 2, 2026 12:4946,269403,767,549382,037,0002,000,0002,453,504