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 listSep 9, 2024 12:13Matthew BookerMatthew BookerScore: 72,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 12:1372,886627,746,090602,955,0001,999,0002,281,472
2Sep 9, 2024 12:1372,895629,134,007604,031,0001,000,0002,273,280
3Sep 9, 2024 12:1372,896632,037,308603,035,0002,000,0002,531,328
4Sep 9, 2024 12:1372,900629,646,113604,073,0001,000,0002,269,184
5Sep 9, 2024 12:1372,901625,113,311603,075,0002,000,0002,289,664
6Sep 9, 2024 12:1372,911632,775,779603,164,0001,997,0002,289,664
7Sep 9, 2024 12:1372,953629,755,128603,509,0001,998,0002,273,280
8Sep 9, 2024 12:1372,973633,631,022603,674,0001,998,0002,289,664
9Sep 9, 2024 12:1372,977633,020,264603,713,0001,999,0002,289,664