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 listDec 4, 2024 12:02NoSIMD_C#NoSIMD_C#Score: 56,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 12:0256,606503,248,052467,834,0001,999,0002,273,280
2Dec 4, 2024 12:0256,619496,590,899467,942,0001,999,0002,260,992
3Dec 4, 2024 12:0256,626498,837,532467,998,0001,999,0002,527,232
4Dec 4, 2024 12:0256,631497,714,619467,037,0003,000,0002,273,280
5Dec 4, 2024 12:0256,632493,435,759469,045,0001,000,0002,523,136
6Dec 4, 2024 12:0256,632494,169,120469,044,0001,000,0002,273,280
7Dec 4, 2024 12:0256,642502,002,747469,128,0001,000,0002,527,232
8Dec 4, 2024 12:0256,646501,223,905468,163,0002,000,0002,273,280
9Dec 4, 2024 12:0256,649496,299,077467,184,0003,001,0002,273,280