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 5, 2026 14:17M-RochatM-RochatScore: 20,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:2520,043185,951,636165,191,0001,167,0002,465,792
2May 5, 2026 14:2520,053180,919,139165,301,0001,139,0002,478,080
3May 5, 2026 14:2520,069184,495,364165,446,0001,128,0002,473,984
4May 5, 2026 14:2520,078183,961,689165,523,0001,130,0002,469,888
5May 5, 2026 14:2520,083182,854,221165,556,0001,136,0002,478,080
6May 5, 2026 14:2520,161181,187,185166,229,0001,110,0002,461,696
7May 5, 2026 14:2520,221183,372,699166,704,0001,133,0002,482,176
8May 5, 2026 14:2520,336188,733,194167,628,0001,161,0002,473,984
9May 5, 2026 14:2520,694188,114,798170,656,0001,111,0002,478,080