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 20, 2026 04:47M-RochatM-RochatScore: 59,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 04:5159,586503,758,068430,724,00063,846,0002,170,880
2May 20, 2026 04:5159,686504,540,309432,343,00063,056,0002,129,920
3May 20, 2026 04:5159,740505,382,775432,207,00063,642,0002,129,920
4May 20, 2026 04:5159,822505,615,013432,076,00064,452,0002,174,976
5May 20, 2026 04:5159,844506,365,341431,561,00065,152,0002,150,400
6May 20, 2026 04:5159,868506,012,552432,431,00064,481,0002,129,920
7May 20, 2026 04:5159,891506,196,425432,095,00065,006,0002,129,920
8May 20, 2026 04:5159,910508,543,393431,814,00065,443,0002,129,920
9May 20, 2026 04:5161,709541,875,557436,193,00075,999,0002,134,016