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 21, 2026 12:32Victor MerckléVictor MerckléScore: 4,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:334,64547,252,59037,496,0001,060,0002,113,536
2May 21, 2026 12:334,65047,260,62737,543,0001,054,0002,113,536
3May 21, 2026 12:334,65348,650,25637,544,0001,078,0002,113,536
4May 21, 2026 12:334,65646,530,34737,565,0001,082,0002,113,536
5May 21, 2026 12:334,66446,509,70337,647,0001,067,0002,113,536
6May 21, 2026 12:334,67246,678,82237,713,0001,072,0002,113,536
7May 21, 2026 12:334,67946,665,96337,818,0001,018,0002,113,536
8May 21, 2026 12:334,68747,469,69237,831,0001,075,0002,113,536
9May 21, 2026 12:334,75948,674,66338,457,0001,044,0002,113,536