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 listJul 2, 2026 17:45A_ShamanA_ShamanScore: 36,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 17:4536,411311,798,348301,206,0001,006,0002,113,536
2Jul 2, 2026 17:4536,414311,782,105301,236,0001,004,0002,113,536
3Jul 2, 2026 17:4536,423312,333,319300,297,0002,021,0002,113,536
4Jul 2, 2026 17:4536,425311,870,869300,318,0002,012,0002,113,536
5Jul 2, 2026 17:4536,427313,250,476301,347,0001,005,0002,113,536
6Jul 2, 2026 17:4536,428312,354,857301,352,0001,005,0002,113,536
7Jul 2, 2026 17:4536,430311,977,598301,371,0001,005,0002,113,536
8Jul 2, 2026 17:4536,430312,348,856301,373,0001,004,0002,113,536
9Jul 2, 2026 17:4536,436312,032,856301,423,0001,004,0002,113,536