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 14, 2026 00:44Jarry XiaoJarry XiaoScore: 11,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 00:4511,569105,709,38695,010,0001,013,0002,117,632
2Jul 14, 2026 00:4511,581105,774,65595,113,0001,012,0002,117,632
3Jul 14, 2026 00:4511,809107,607,18097,010,0001,012,0002,117,632
4Jul 14, 2026 00:4511,852108,082,35697,355,0001,017,0002,117,632
5Jul 14, 2026 00:4511,948108,848,90398,160,0001,013,0002,117,632
6Jul 14, 2026 00:4511,981109,067,01798,435,0001,015,0002,117,632
7Jul 14, 2026 00:4511,990109,073,53598,504,0001,015,0002,117,632
8Jul 14, 2026 00:4512,006109,257,94998,641,0001,014,0002,117,632
9Jul 14, 2026 00:4512,095110,322,45299,377,0001,014,0002,117,632