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 04:53EdgarEdgarScore: 20,637Success
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 04:5320,528180,638,409167,351,0003,037,0002,117,632
2Sep 24, 2026 04:5320,567181,161,736167,621,0003,086,0002,117,632
3Sep 24, 2026 04:5320,585181,130,911167,810,0003,046,0002,117,632
4Sep 24, 2026 04:5320,636181,550,408168,183,0003,104,0002,117,632
5Sep 24, 2026 04:5320,637181,619,744168,234,0003,058,0002,117,632
6Sep 24, 2026 04:5320,643183,006,203168,149,0003,192,0002,117,632
7Sep 24, 2026 04:5320,679181,966,535168,521,0003,119,0002,117,632
8Sep 24, 2026 04:5320,687181,971,404168,664,0003,039,0002,117,632
9Sep 24, 2026 04:5321,105185,615,977172,048,0003,128,0002,117,632