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 listMay 3, 2026 04:03limanjun99limanjun99Score: 18,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 04:0317,779166,057,893141,585,0005,982,0002,408,448
2May 3, 2026 04:0317,803167,816,131141,776,0005,990,0002,420,736
3May 3, 2026 04:0317,849165,147,863142,144,0006,006,0002,408,448
4May 3, 2026 04:0317,892163,620,828141,528,0006,976,0002,416,640
5May 3, 2026 04:0318,882171,772,223151,733,0004,991,0002,437,120
6May 3, 2026 04:0318,889172,807,464152,790,0003,994,0002,412,544
7May 3, 2026 04:0318,900171,354,329150,877,0005,995,0002,433,024
8May 3, 2026 04:0318,901175,041,411150,891,0005,995,0002,486,272
9May 3, 2026 04:0318,961174,968,470151,401,0005,976,0002,416,640