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 listApr 10, 2026 15:29Danylo MocherniukDanylo MocherniukScore: 4,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 15:294,47163,729,34235,104,0002,005,0002,297,856
2Apr 10, 2026 15:294,59059,688,91535,086,0003,007,0002,392,064
3Apr 10, 2026 15:294,59459,911,36835,123,0003,010,0002,297,856
4Apr 10, 2026 15:294,70864,433,77336,069,0003,005,0002,392,064
5Apr 10, 2026 15:294,71362,799,71136,113,0003,009,0002,297,856
6Apr 10, 2026 15:294,73861,150,56837,309,0002,016,0002,387,968
7Apr 10, 2026 15:294,74762,082,74736,371,0003,030,0002,297,856
8Apr 10, 2026 15:294,77864,932,54737,621,0002,033,0002,297,856
9Apr 10, 2026 15:294,85168,634,70237,241,0003,019,0002,297,856