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, 2025 17:55CCScore: 397,865Success
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, 2025 17:56393,1673,294,261,9523,210,310,00052,972,0002,281,472
2Jul 2, 2025 17:56396,4723,315,651,9843,224,745,00065,974,0002,281,472
3Jul 2, 2025 17:55396,8393,321,120,2493,220,790,00072,972,0002,281,472
4Jul 2, 2025 17:55397,8653,326,043,9433,228,322,00073,961,0002,281,472
5Jul 2, 2025 17:56399,0173,339,644,2293,234,871,00076,973,0002,281,472
6Jul 2, 2025 17:55401,7853,363,108,0173,264,838,00069,975,0002,281,472