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 8, 2026 09:12Danylo MocherniukDanylo MocherniukScore: 5,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 09:125,85172,151,30747,552,0001,011,0002,297,856
2Apr 8, 2026 09:125,85576,499,41847,584,0001,012,0002,412,544
3Apr 8, 2026 09:125,86273,726,62547,641,0001,013,0002,428,928
4Apr 8, 2026 09:125,88075,637,30546,816,0001,992,0002,424,832
5Apr 8, 2026 09:125,88574,027,55547,847,000996,0002,428,928
6Apr 8, 2026 09:125,90375,951,86147,992,000999,0002,424,832