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 9, 2025 02:33Leon ZhaoLeon ZhaoScore: 14,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 02:3314,909148,950,027121,753,0001,995,0002,469,888
2Aug 9, 2025 02:3314,910151,153,665121,754,0001,995,0002,482,176
3Aug 9, 2025 02:3314,911153,720,612121,766,0001,996,0002,473,984
4Aug 9, 2025 02:3314,911151,824,075121,764,0001,996,0002,285,568
5Aug 9, 2025 02:3314,913153,854,358121,780,0001,996,0002,473,984
6Aug 9, 2025 02:3314,916149,417,390122,804,000998,0002,285,568
7Aug 9, 2025 02:3314,918155,022,575121,819,0001,997,0002,285,568
8Aug 9, 2025 02:3314,918151,173,880121,826,0001,997,0002,473,984
9Aug 9, 2025 02:3314,927150,415,718121,898,0001,998,0002,281,472