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 listMar 28, 2026 02:18zielajzielajScore: 3,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 02:313,44252,582,19127,551,0001,020,0002,437,120
2Mar 28, 2026 02:313,45553,727,40127,656,0001,024,0002,523,136
3Mar 28, 2026 02:303,46754,742,68426,789,0001,984,0002,527,232
4Mar 28, 2026 02:313,47253,678,49827,828,000993,0002,510,848
5Mar 28, 2026 02:183,47352,219,94326,836,0001,987,0002,523,136
6Mar 28, 2026 02:303,47459,239,67527,840,000994,0002,445,312
7Mar 28, 2026 02:183,47555,857,42526,853,0001,989,0002,433,024
8Mar 28, 2026 02:303,47554,958,21426,855,0001,989,0002,437,120
9Mar 28, 2026 02:183,47655,705,98926,861,0001,989,0002,433,024