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 listFeb 15, 2026 22:31wnwnScore: 9,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:318,54599,152,20463,928,0006,992,0002,277,376
2Feb 15, 2026 22:318,59392,875,31164,287,0007,031,0002,412,544
3Feb 15, 2026 22:318,652100,500,68263,836,0007,979,0002,453,504
4Feb 15, 2026 22:319,623107,066,70369,889,0009,984,0002,461,696
5Feb 15, 2026 22:319,739112,281,73471,851,0008,981,0002,306,048
6Feb 15, 2026 22:319,864107,221,02371,885,0009,984,0002,400,256