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 listFeb 11, 2026 18:38olliecrowolliecrowScore: 15,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:3815,795155,754,019127,094,0004,002,0002,506,752
2Feb 11, 2026 18:3815,834154,568,325127,407,0004,012,0002,408,448
3Feb 11, 2026 18:3815,870159,704,528129,722,0001,995,0002,306,048