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 11, 2026 19:27olliecrowolliecrowScore: 6,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:276,14077,837,58747,967,0002,997,0002,293,760
2Feb 11, 2026 19:276,16277,308,91249,141,0002,005,0002,408,448
3Feb 11, 2026 19:276,19677,436,98849,413,0002,016,0002,355,200
4Feb 11, 2026 19:276,48278,610,76651,808,0001,992,0002,437,120
5Feb 11, 2026 19:276,52777,999,54152,167,0002,006,0002,383,872
6Feb 11, 2026 19:276,55279,992,72851,358,0003,021,0002,265,088