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 listApr 10, 2026 15:07Danylo MocherniukDanylo MocherniukScore: 4,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 15:074,57959,491,45436,006,0002,000,0002,396,160
2Apr 10, 2026 15:074,59663,466,36135,137,0003,011,0002,297,856
3Apr 10, 2026 15:074,60259,685,36535,180,0003,015,0002,392,064
4Apr 10, 2026 15:074,60560,844,64535,202,0003,017,0002,400,256
5Apr 10, 2026 15:074,62168,241,69536,337,0002,018,0002,392,064
6Apr 10, 2026 15:074,70060,645,83236,011,0003,000,0002,396,160
7Apr 10, 2026 15:074,72469,178,11737,198,0002,010,0002,297,856
8Apr 10, 2026 15:074,74763,562,48536,368,0003,030,0002,392,064
9Apr 10, 2026 15:074,79968,043,25336,843,0002,987,0002,297,856
10Apr 10, 2026 15:074,80065,390,82736,849,0002,987,0002,297,856
11Apr 10, 2026 15:074,81565,614,17336,966,0002,997,0002,392,064
12Apr 10, 2026 15:074,87764,038,93939,465,0001,011,0002,379,776