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 listAug 24, 2026 18:17Victor MerckléVictor MerckléScore: 64,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:1863,457535,314,276525,612,0001,085,0002,117,632stderr
2Aug 24, 2026 18:1863,511536,558,234526,136,0001,012,0002,117,632stderr
3Aug 24, 2026 18:1863,882538,601,921529,204,0001,024,0002,117,632stderr
4Aug 24, 2026 18:1864,169540,939,572531,562,0001,047,0002,117,632stderr
5Aug 24, 2026 18:1864,387543,550,042533,414,0001,004,0002,117,632stderr
6Aug 24, 2026 18:1864,410547,361,923533,589,0001,017,0002,117,632stderr
7Aug 24, 2026 18:1864,431547,929,613533,756,0001,026,0002,117,632stderr
8Aug 24, 2026 18:1864,493548,292,455534,275,0001,022,0002,117,632stderr
9Aug 24, 2026 18:1865,561557,079,172540,940,0003,224,0002,117,632stderr