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 7, 2026 08:40wnwnScore: 3,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:413,38842,881,72527,025,0001,102,0002,486,272
2May 7, 2026 08:413,38942,865,07127,088,0001,047,0002,490,368
3May 7, 2026 08:413,41244,872,69527,259,0001,064,0002,490,368
4May 7, 2026 08:413,48046,734,09227,794,0001,090,0002,502,656
5May 7, 2026 08:413,52446,207,47228,171,0001,080,0002,486,272
6May 7, 2026 08:413,53046,541,62728,211,0001,089,0002,482,176
7May 7, 2026 08:413,55845,623,58528,462,0001,077,0002,482,176
8May 7, 2026 08:413,57346,861,56628,572,0001,089,0002,486,272
9May 7, 2026 08:413,59843,728,56128,794,0001,075,0002,494,464