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 listJun 29, 2026 20:45Adam FolwarcznyAdam FolwarcznyScore: 9,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:469,76990,348,58379,944,0001,141,0002,113,536
2Jun 29, 2026 20:469,77990,919,85380,136,0001,036,0002,113,536
3Jun 29, 2026 20:469,78090,543,51080,137,0001,040,0002,113,536
4Jun 29, 2026 20:469,85991,166,81380,787,0001,048,0002,113,536
5Jun 29, 2026 20:469,86991,199,51480,810,0001,109,0002,113,536
6Jun 29, 2026 20:4610,26594,500,08384,043,0001,161,0002,113,536
7Jun 29, 2026 20:4610,26894,578,00684,178,0001,048,0002,113,536
8Jun 29, 2026 20:4610,26994,579,54784,188,0001,045,0002,113,536
9Jun 29, 2026 20:4610,27694,664,68084,257,0001,037,0002,113,536