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 11, 2026 20:39TudyMTudyMScore: 34,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:4034,183292,271,853282,639,0001,084,0002,113,536
2May 11, 2026 20:4034,192294,386,367282,700,0001,098,0002,113,536
3May 11, 2026 20:4034,196294,797,225282,730,0001,101,0002,113,536
4May 11, 2026 20:4034,199293,735,895282,756,0001,098,0002,113,536
5May 11, 2026 20:4034,200292,425,012282,757,0001,103,0002,113,536
6May 11, 2026 20:4034,210293,586,837282,757,0001,186,0002,113,536
7May 11, 2026 20:4034,211292,815,619282,852,0001,104,0002,113,536
8May 11, 2026 20:4034,219294,493,558282,951,0001,073,0002,113,536
9May 11, 2026 20:4034,225292,983,380283,047,0001,027,0002,113,536