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 listMar 28, 2026 22:16Dominique GarmierDominique GarmierScore: 48,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 06:0248,690433,099,794401,131,0003,000,0002,543,616
2Mar 28, 2026 22:3448,698432,765,702403,190,0001,000,0002,334,720
3Mar 28, 2026 22:1648,703429,629,686402,236,0002,001,0002,334,720
4Mar 28, 2026 22:3448,706429,547,361402,257,0002,001,0002,535,424
5Mar 29, 2026 06:0248,709425,553,653403,286,0001,000,0002,535,424
6Mar 28, 2026 22:1648,711424,374,979402,304,0002,001,0002,535,424
7Mar 28, 2026 22:3448,711431,373,859401,297,0003,002,0002,383,872
8Mar 29, 2026 06:0248,712439,455,276403,312,0001,000,0002,535,424
9Mar 28, 2026 22:1648,727433,522,971402,428,0002,002,0002,334,720