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 listAug 29, 2026 16:57Josu San MartinJosu San MartinScore: 4,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:004,69147,354,20737,905,0001,035,0002,113,536
2Aug 29, 2026 17:004,70147,464,21037,992,0001,031,0002,113,536
3Aug 29, 2026 17:004,70647,474,44038,018,0001,049,0002,113,536
4Aug 29, 2026 17:004,70847,472,87037,945,0001,135,0002,113,536
5Aug 29, 2026 17:004,71948,345,09238,140,0001,030,0002,113,536
6Aug 29, 2026 17:004,72248,945,76938,057,0001,136,0002,113,536
7Aug 29, 2026 17:004,73147,710,69738,146,0001,125,0002,113,536
8Aug 29, 2026 17:004,73147,762,01238,119,0001,155,0002,113,536
9Aug 29, 2026 17:004,73147,644,50238,168,0001,105,0002,113,536