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 31, 2026 18:33George SeabridgeGeorge SeabridgeScore: 17,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:3317,456154,863,845143,807,0001,082,0002,113,536
2Jul 31, 2026 18:3317,462154,923,885143,857,0001,079,0002,113,536
3Jul 31, 2026 18:3317,466155,708,928143,894,0001,082,0002,113,536
4Jul 31, 2026 18:3317,543155,745,287144,520,0001,094,0002,113,536
5Jul 31, 2026 18:3317,570156,630,334144,589,0001,244,0002,113,536
6Jul 31, 2026 18:3317,588156,047,027144,901,0001,085,0002,113,536
7Jul 31, 2026 18:3317,607156,144,678145,060,0001,084,0002,113,536
8Jul 31, 2026 18:3317,649156,504,601145,405,0001,084,0002,113,536
9Jul 31, 2026 18:3321,294186,752,129175,612,0001,130,0002,113,536