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 24, 2026 13:47Victor MerckléVictor MerckléScore: 17,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:5017,432153,522,899143,551,0001,138,0002,117,632stderr
2May 24, 2026 13:5017,490154,651,388144,130,0001,045,0002,117,632stderr
3May 24, 2026 13:5017,502156,396,276144,219,0001,054,0002,117,632stderr
4May 24, 2026 13:5017,502155,232,524144,197,0001,075,0002,117,632stderr
5May 24, 2026 13:5017,531154,225,214144,376,0001,137,0002,117,632stderr
6May 24, 2026 13:5017,544153,387,189144,569,0001,050,0002,117,632stderr
7May 24, 2026 13:5017,574153,680,310144,821,0001,048,0002,117,632stderr
8May 24, 2026 13:5017,609154,988,745145,025,0001,130,0002,117,632stderr
9May 24, 2026 13:5017,664154,261,139145,475,0001,141,0002,117,632stderr