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 30, 2026 18:17Josu San MartinJosu San MartinScore: 4,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:174,38745,193,44235,308,0001,106,0002,113,536
2Aug 30, 2026 18:174,38844,857,26035,415,0001,013,0002,113,536
3Aug 30, 2026 18:174,40245,028,17235,467,0001,077,0002,113,536
4Aug 30, 2026 18:174,40945,009,82835,481,0001,114,0002,113,536
5Aug 30, 2026 18:174,41945,147,36435,549,0001,135,0002,113,536
6Aug 30, 2026 18:174,42245,186,71435,589,0001,114,0002,113,536
7Aug 30, 2026 18:174,42445,110,62235,687,0001,039,0002,113,536
8Aug 30, 2026 18:174,42645,281,76535,713,0001,029,0002,113,536
9Aug 30, 2026 18:174,49945,767,34936,303,0001,039,0002,113,536