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 listNov 4, 2025 04:18Tejas G.Tejas G.Score: 9,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:189,730105,054,99878,763,0001,994,0002,277,376
2Nov 4, 2025 04:189,744104,462,94978,878,0001,996,0002,519,040
3Nov 4, 2025 04:189,745109,346,26178,885,0001,997,0002,351,104
4Nov 4, 2025 04:189,867110,889,09279,897,0001,997,0002,523,136
5Nov 4, 2025 04:189,884107,118,34780,035,0002,000,0002,506,752
6Nov 4, 2025 04:189,977110,086,46080,810,0001,995,0002,285,568