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 listMar 6, 2025 06:01NoSIMD_C#NoSIMD_C#Score: 50,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 14:3650,052443,509,465415,433,00002,437,120
2Apr 8, 2025 14:3650,071445,922,074414,592,000999,0002,424,832
3Mar 6, 2025 06:0150,075440,714,305414,626,000999,0002,531,328
4Apr 8, 2025 14:3650,078442,595,973414,648,000999,0002,531,328
5Mar 6, 2025 06:0150,092438,917,501413,762,0001,998,0002,531,328
6Mar 6, 2025 06:0150,132443,850,434414,098,0002,000,0002,428,928