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:17Oleg SkinderevOleg SkinderevScore: 75,654Success
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:1775,633653,845,369573,772,00053,978,0002,281,472
2Apr 10, 2026 15:1775,654649,952,853578,935,00048,994,0002,428,928
3Apr 10, 2026 15:1775,666652,589,992568,023,00060,002,0002,314,240