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 listJan 7, 2026 13:11Pavel SkripkinPavel SkripkinScore: 81,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 13:1181,740706,570,132444,633,000233,807,0002,469,888
2Jan 7, 2026 13:1181,994704,742,983441,708,000238,842,0002,314,240
3Jan 7, 2026 13:1182,443708,193,795442,530,000241,743,0002,285,568