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 6, 2026 15:26Danylo MocherniukDanylo MocherniukScore: 6,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:256,67182,635,39953,356,0002,013,0002,523,136
2Apr 6, 2026 15:266,67478,918,74854,389,0001,007,0002,297,856
3Apr 6, 2026 15:266,68578,139,87653,470,0002,017,0002,433,024
4Apr 6, 2026 15:256,72483,159,22754,816,000996,0002,297,856
5Apr 6, 2026 15:266,72581,177,13953,825,0001,993,0002,428,928
6Apr 6, 2026 15:266,73281,519,68854,879,000997,0002,441,216
7Apr 6, 2026 15:256,73884,572,45352,927,0002,995,0002,297,856
8Apr 6, 2026 15:266,73887,120,18553,932,0001,997,0002,420,736
9Apr 6, 2026 15:266,74478,219,18752,976,0002,998,0002,420,736