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 listNov 29, 2024 10:16NoSIMD_C#NoSIMD_C#Score: 69,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 10:1669,184599,713,090510,202,00064,025,0002,277,376
2Nov 29, 2024 10:1669,202599,710,696523,341,00051,033,0002,273,280
3Nov 29, 2024 10:1669,322607,970,746506,326,00069,044,0002,285,568