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 21:51M-RochatM-RochatScore: 6,717Success
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 21:516,59364,427,45352,661,0002,061,0002,113,536
2May 21, 2026 21:516,61564,811,82952,841,0002,070,0002,113,536
3May 21, 2026 21:516,69566,284,26453,443,0002,131,0002,113,536
4May 21, 2026 21:516,69565,216,31253,498,0002,076,0002,113,536
5May 21, 2026 21:516,71765,635,18653,589,0002,170,0002,113,536
6May 21, 2026 21:516,72668,030,94553,651,0002,177,0002,113,536
7May 21, 2026 21:516,78966,332,20154,104,0002,251,0002,113,536
8May 21, 2026 21:516,79168,266,42754,189,0002,177,0002,113,536
9May 21, 2026 21:516,79367,821,24654,089,0002,295,0002,113,536