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 18:18olliecrowolliecrowScore: 6,288Success
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 18:185,94775,491,04746,335,0003,021,0002,363,392
2Feb 11, 2026 18:186,09081,402,82948,526,0002,021,0002,437,120
3Feb 11, 2026 18:186,09078,434,46949,538,0001,010,0002,428,928
4Feb 11, 2026 18:186,28880,750,02047,170,0005,018,0002,453,504
5Feb 11, 2026 18:186,39284,969,73551,049,0002,001,0002,342,912
6Feb 11, 2026 18:186,61783,888,54349,931,0004,993,0002,277,376