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 listMay 20, 2026 10:15Victor MerckléVictor MerckléScore: 5,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:155,71357,019,52646,390,0001,035,0002,113,536
2May 20, 2026 10:155,89758,308,09847,934,0001,015,0002,113,536
3May 20, 2026 10:155,92357,552,61248,139,0001,025,0002,113,536
4May 20, 2026 10:155,92358,560,67348,125,0001,038,0002,113,536
5May 20, 2026 10:155,92357,585,76548,130,0001,035,0002,113,536
6May 20, 2026 10:155,92557,934,77048,147,0001,035,0002,113,536
7May 20, 2026 10:155,93660,428,34548,250,0001,025,0002,113,536
8May 20, 2026 10:155,93957,499,38148,291,0001,005,0002,113,536
9May 20, 2026 10:155,95758,626,49848,444,0001,000,0002,113,536