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 listSep 24, 2026 20:26janwwwjanwwwScore: 62,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 20:2662,324527,759,525454,203,00063,093,0002,117,632
2Sep 24, 2026 20:2662,364527,922,614453,709,00063,917,0002,117,632
3Sep 24, 2026 20:2662,380528,129,226454,525,00063,236,0002,117,632
4Sep 24, 2026 20:2662,407528,361,252454,135,00063,848,0002,117,632
5Sep 24, 2026 20:2662,419528,540,776454,967,00063,117,0002,117,632
6Sep 24, 2026 20:2662,429528,472,142454,302,00063,859,0002,117,632
7Sep 24, 2026 20:2662,478528,842,564455,305,00063,265,0002,117,632
8Sep 24, 2026 20:2662,494529,083,907455,280,00063,427,0002,117,632
9Sep 24, 2026 20:2662,515529,213,350454,796,00064,081,0002,117,632