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 15, 2026 12:57Victor MerckléVictor MerckléScore: 6,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 12:586,96166,850,62056,737,0001,043,0002,113,536
2May 15, 2026 12:586,96165,085,37756,742,0001,042,0002,113,536
3May 15, 2026 12:586,96266,863,50556,784,0001,006,0002,113,536
4May 15, 2026 12:586,96465,210,82757,809,00002,113,536
5May 15, 2026 12:586,96465,116,76657,803,00002,113,536
6May 15, 2026 12:586,96565,783,82156,782,0001,033,0002,113,536
7May 15, 2026 12:586,96665,623,43956,777,0001,043,0002,113,536
8May 15, 2026 12:587,01767,398,09558,247,00002,113,536
9May 15, 2026 12:587,09168,439,10257,854,0001,004,0002,113,536